Niemelä and Schwind : Proof Systems for Nonmonotonic Logics
نویسندگان
چکیده
A survey of proof systems for nonmonotonic logics is presented. In particular , proof methods for default logics, nonmonotonic modal logics, circum-scription, and conditional logics are discussed.
منابع مشابه
Tableau Calculi for Preference-Based Conditional Logics
In this paper we develop labelled and uniform tableau methods for some fundamental system of propositional conditional logics. We consider the well-known system CE (that can be seen as a generalization of preferential nonmonotonic logic), and some related systems. Our tableau proof procedures are based on a possible-worlds structures endowed with a family of preference relations. The tableau pr...
متن کاملModal Tableaux for Nonmonotonic Reasoning
Artosi and Governatori (1994) and Artosi, Cattabriga and Governatori (1994) presented a tableau-like proof system, called KEM , which has been proven to be able to cope with a wide variety of (normal) modal logics. KEM is based on D’Agostino and Mondadori’s (1994) classical proof system KE, a combination of tableau and natural deduction inference rules which allows for a restricted (“analytic”)...
متن کاملModal Tableaux for Nonmonotonic Reasoning 1 Introduction
Artosi and Governatori (1994) and Artosi, Cattabriga and Governatori (1994) presented a tableau-like proof system, called KEM , which has been proven to be able to cope with a wide variety of (normal) modal logics. KEM is based on D’Agostino and Mondadori’s (1994) classical proof system KE, a combination of tableau and natural deduction inference rules which allows for a restricted (“analytic”)...
متن کاملOn the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to “define” propositions using default assumptions about the same propositions is identified as a major source of computational complexity in nonmonotonic reasoning. If such constructs are not allowed, i.e. stratified knowledge bases are considered, a significant...
متن کاملGentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence
While the purpose of conventional proof calculi is to axiomatise the set of valid sentences of a logic, refutation systems axiomatise the invalid sentences. Such systems are relevant not only for proof-theoretic reasons but also for realising deductive systems for nonmonotonic logics. We introduce Gentzen-type refutation systems for two basic three-valued logics and we discuss an application of...
متن کامل